Performance Analysis of Active Queue Management Scheme for Bursty and Correlated Multi-Class Traffic

نویسنده

  • L. Guan
چکیده

With the rapid growth of Internet traffic, the control of congestion to enable different types of Internet traffic to satisfy specified Quality of Service (QoS) constraints is becoming increasingly important. This motivates the stochastic analysis of a discrete-time queueing system for the performance evaluation of active queue management (AQM) scheme based congestion control mechanism called Random Early Detection (RED) with bursty and correlated traffic using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. The stochastic analysis of the queue considered could be of interest for the performance evaluation of AQM for the multiple-class traffic with short range dependent (SRD) traffic characteristics. Analytical expressions for various performance metrics are computed and typical numerical experiments are included to illustrate the credibility of the proposed mechanism in the context of external bursty and correlated traffic. These experiments clearly demonstrate how different threshold settings can provide different tradeoffs between loss probability and delay to suit different service requirements. The effect of input parameters on various performance metrics, burstiness and correlations for the arrival process are also presented. The model is applicable to high speed networks which use slotted protocols.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete-time performance analysis of a congestion control mechanism based on RED under multi-class bursty and correlated traffic

Internet traffic congestion control using queue thresholds is a well known and effective mechanism. This motivates the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the active queue management (AQM) based congestion control mechanism called Random Early Detection (RED) with bursty and correlated traffic using a two-state Markov-Modulated Bernoulli arr...

متن کامل

Performance Analysis of Queueing Networks with Complete Buffer Partitioning

This chapter extends the analysis of networks of queues under repetitive service blocking mechanism presented in Chapter 4 by considering a different buffer management scheme, namely, complete buffer partitioning (CBP). This analysis considers the networks with arbitrary configuration where each node in the networks employs an active queue management (AQM) type buffer management scheme to guara...

متن کامل

A Parallel Queue Structure for Active Queue Management

Performance of the Adaptive RED scheme is susceptible to bursty web traffic. A parallel queue structure was proposed earlier to address this problem, where real time connections (such as web and UDP) and non-real time connections (such as FTP) are served in two different queues with droptail and Adaptive RED policies, respectively. In this paper a modified Adaptive RED scheme is proposed for th...

متن کامل

Detecting and Filtering Non-responsive Traffic in AQM Queues without Packet Header Examination

In the current Internet, long-term TCP flows and bursty shortterm flows both exist. The mix between the aggregated longterm TCP traffic (responsive traffic) and the bursty traffic (non-responsive traffic) has great impact on the performance of Active Queue Management (AQM) algorithms in routers. We introduce a new solution to differentiate between responsive and unresponsive traffic in AQM queu...

متن کامل

IAPI: An intelligent adaptive PI active queue management scheme

Internet traffic is bursty and unpredictable. It is therefore important to control congestion to protect users from traffic surges in a way that is efficient, stable and robust. Research has shown that active queue management (AQM) has the potential to control congestion such that these requirements are met. However, despite much work and many published proposals of AQM algorithms, a satisfacto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005